Potentially self-complementary degree sequences
نویسندگان
چکیده
منابع مشابه
On potentially P-graphic degree sequences
A sequence 1l = (d 1 ,d 2 , ... ,d n) of positive integers is said to be graphic if there exists a simple graph G such that 1£ is the degree sequence of G. For a specified property P of graphs. a sequence 1l = (d 1 ,d 2 • ... • d n) of positive integers is said to be potentially P-graphic if 1l is graphic and there exists a realization of 1l with the property P. In this paper we characterize po...
متن کاملThe smallest degree sum that yields potentially kCl-graphic sequences
In this paper we consider a variation of the classical Turán-type extremal problems. Let S be an n-term graphical sequence, and σ(S) be the sum of the terms in S. Let H be a graph. The problem is to determine the smallest even l such that any n-term graphical sequence S having σ(S) ≥ l has a realization containing H as a subgraph. Denote this value l by σ(H, n). We show σ(C2m+1, n) = m(2n−m− 1)...
متن کاملEfficient 5'-end labeling of oligonucleotides containing self-complementary sequences.
Synthetic oligonucleotides have become basic tools in molecular biology research and are commonly used for cloning and characterization of genes, analysis of gene expression and so on. Frequently, the success of techniques such as DNA and RNA sequencing, screening of libraries, nuclease S1 and RNase protection assays or polymerase chain reaction (PCR) amplification depends on appropriate design...
متن کاملPermissible base sequences for non self complementary messenger RNAs.
It is a well accepted assumption that the transcription of DNA is done along a single strand (T o c c h in i-Va l e n t in e and cols.1, S p ie g e l m a n and H a y a s h i 2, M a r m u r 3 and T o h ä C. 4) and that the biosynthetic mRNA obtained is monoteonic and is read in a linear fashion during the process of translation. In order to have a good interaction with the ribosome and an easy r...
متن کاملPotentially H-bigraphic sequences
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative integer sequences. The sequence pair S = (A,B) is said to be bigraphic if there is some bipartite graph G = (X ∪ Y, E) such that A and B are the degrees of the vertices in X and Y , respectively. If S is a bigraphic pair, let σ(S) denote the sum of the terms in A. Given a bigraphic pair S, and a fixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1976
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90069-1